Bijective Counting of Involutive Baxter Permutations
نویسنده
چکیده
We enumerate bijectively the family of involutive Baxter permutations according to various parameters; in particular we obtain an elementary proof that the number of involutive Baxter permutations of size 2n with no fixed points is 3·2 n−1
منابع مشابه
Involutive Yang-baxter Groups
In 1992 Drinfeld posed the question of finding the set-theoretic solutions of the Yang-Baxter equation. Recently, Gateva-Ivanova and Van den Bergh and Etingof, Schedler and Soloviev have shown a group-theoretical interpretation of involutive non-degenerate solutions. Namely, there is a oneto-one correspondence between involutive non-degenerate solutions on finite sets and groups of I-type. A gr...
متن کامل3 M ar 2 00 9 Retractability of set theoretic solutions of the Yang - Baxter equation ∗
It is shown that square free set theoretic involutive non-degenerate solutions of the Yang-Baxter equation whose associated permutation group (referred to as an involutive Yang-Baxter group) is abelian are retractable in the sense of Etingof, Schedler and Soloviev. This solves a problem of Gateva-Ivanova in the case of abelian IYB groups. It also implies that the corresponding finitely presente...
متن کاملRetractability of Set Theoretic Solutions of the Yang-baxter Equation *
It is shown that square free set theoretic involutive non-degenerate solutions of the Yang-Baxter equation whose associated permutation group (referred to as an involutive Yang-Baxter group) is abelian are retractable in the sense of Etingof, Schedler and Soloviev. This solves a problem of Gateva-Ivanova in the case of abelian IYB groups. It also implies that the corresponding finitely presente...
متن کاملBijective Combinatorics of Reduced Decompositions
We study the bijective combinatorics of reduced words. These are fundamental objects in the study of Coxeter groups. We restrict our focus to reduced words of permutations and signed permutations. Our results can all be situated within the context of two parallels. The first parallel is between the enumerative theory of reduced words and that of Coxeter group elements. The second parallel is be...
متن کاملApplying the Cluster Method to Count Occurrences of Generalized Permutation Patterns
Abstract. We apply ideas from the cluster method to q-count the permutations of a multiset according to the number of occurrences of certain generalized patterns, as defined by Babson and Steingŕımsson. In particular, we consider those patterns with three letters and one internal dash, as well as permutation statistics composed of counting the number of occurrences of multisets of such patterns...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Fundam. Inform.
دوره 117 شماره
صفحات -
تاریخ انتشار 2012